منابع مشابه
Self-Adjusting Binary Search Trees: What Makes Them Tick?
Splay trees (Sleator and Tarjan [8]) satisfy the so-called access lemma. Many of the nice properties of splay trees follow from it. What makes self-adjusting binary search trees (BSTs) satisfy the access lemma? We propose a global view of BST algorithms, which allows us to identify general structural properties of algorithms that satisfy the access lemma. As an application of our techniques, we...
متن کاملA Randomized Self-Adjusting Binary Search Tree
We present algorithms for a new self-adjusting binary search tree, which we call a shuffle tree. The tree is easy to implement and does not require parent pointers or balancing information to be stored in tree nodes. A maximum of one rotation is probabilistically applied during each traversal, which keeps the cost of balancing activity low. We present tests to compare the performance of shuffle...
متن کاملThe Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees
This paper introduces the problem of communication pattern adaption for a distributed self-adjusting binary search tree. We propose a simple local algorithm that is closely related to the over thirty-year-old idea of splay trees and evaluate its adaption performance in the distributed scenario if different communication patterns are provided. To do so, the process of self-adjustment is modeled ...
متن کاملSelf-Adjusting Trees
The reactive diffracting trees are known efficient distributed data structures for supporting synchronization. They not only distribute a set of processes to smaller groups accessing different parts of the memory in a global coordinated manner, but also adjust their size in order to attain efficient performance across different levels of contention. However, the existing reactive adjustment pol...
متن کاملSelf-Adjusting Distributed Trees
An object retrieval protocol that enforces mutually exclusive access to a shared object is an important primitive employed by many distributed applications including distributed directories, distributed resource sharing systems and ordered multicast protocols, to name a few. Most existing implementations of this object retrieval primitive use a tree as the underlying communication structure due...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1985
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3828.3835